Cross Cutting Condensed Graphs
نویسندگان
چکیده
Condensed Graphs provide a graph based programming model that unifies availability-driven, coerciondriven and control-driven computing. In this paper we explore the issues of concurrency and synchronisation between condensed graph applications. A paradigm for condensed graph synchronisation is proposed and an architectural pattern is developed that forms the basis of a novel synchronisation mechanism.
منابع مشابه
Using Classpects for Integrating Non-Functional and Functional Requirements
Aspects are originally introduced to capture cross-cutting concerns among classes. Often this cross-cutting concerns ends up being non-functional requirements. We can use Softgoal Interdependency Graphs(SIG) to systematically analyze and design non-functional requirements. In this paper, we propose a set of rules that could be used to capture the information in SIGs as classpects. Then the clas...
متن کاملCondensed Graphs : A Multi - Level , Parallel , Intermediate
Condensed graphs are proposed as an intermediate representation for functional and imperative languages. This representation may be executed on a variety of architectures, implementing a multi-level Condensed Graphs abstract machine. This machine incorporates characteristics and feedback information of its underlying architecture and guides dynamic topological transformations of the representat...
متن کاملObject Oriented Condensed Graphs
Abstract. Even though Object Orientation has been proven to be an effective programming paradigm for software development, it has not been shown to be an ideal solution for the development of large scale parallel and distributed systems. There are a number of reasons for this: the parallelism and synchronisation in these systems has to be explicitly managed by the programmer; few Object Oriente...
متن کاملAspect Mining based on Control-Flow
Aspect mining tries to identify crosscutting concerns in existing systems and thus supports the adaption to an aspectoriented design. This paper describes an automatic static aspect mining approach, where the control flow graphs of a program are investigated for recurring execution patterns based on different constraints, such as the requirement that the patterns have to exist in different call...
متن کاملLifting and separation procedures for the cut polytope
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied over the last 25 years. However, little research has been conducted for the cut polytope on arbitrary graphs. In this study we describe new separation and lifting procedures for the cut polytope on such graphs. These procedures exploit algorithmic and structural results known for the cut polytop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005